bottleneck assignment problem

英 [ˈbɒtlnek əˈsaɪnmənt ˈprɒbləm]

美 [ˈbɑːtlnek əˈsaɪnmənt ˈprɑːbləm]

网络瓶颈指派问题; 瓶颈分派问题

In this paper, we give a new algorithm for the bottleneck assignment problem on the basis of Knig s theorem, and show that the time complexity of the algorithm is O ( n3).
本文对瓶颈指派问题给出了一种新的算法，该算法不需要利用最大流算法，而类似于解经典指派问题的匈牙利算法。
In this paper, a dynamic programming model of the m-dimensional bottleneck assignment problem is established, also a suitable solution of this model is given based on entropy.
对此问题建立了动态规划模型，并利用熵作为工具给出了动态规划模型的解。
2-Dimensional Bottleneck Assignment Problem and its Algorithm
二维瓶颈指派问题的动态规划算法
A Polynomial-time Algorithm for the Bottleneck Assignment Problem
瓶颈指派问题的一种多项式时间算法
A Fuzzy Decision Model in the Bottleneck Assignment Problem
工作分派问题的一种模糊决策模型
But in the new form of requirements and promoting, the bottleneck began to appear, especially the problem of the intellectual property rights in combination with the interests of joint ownership assignment problem, make the further promoting the combination of joint work dilemma.
但在新的形式的要求与推动下，产学研联合中的瓶颈问题开始出现，尤其是知识产权在产学研联合中的权利归属与利益分配问题，使产学研联合工作的进一步推动面临困境。